Identifying Job Migration Characteristics in Decentralized Grid Scheduling Scenarios
نویسندگان
چکیده
This paper explores the characteristics of job migration between different parallel compute sites in a decentralized Grid scenario sharing a central job pool. Independent users are assumed to submit their jobs to their local site MPP installation, which in turn is allowed to decline the local execution of jobs by offering them to a central job pool. The simulation results are obtained using real workload traces and compared to the EASY backfilling single site algorithm. It is shown that even simple job pooling is beneficial for all high utilized sites as it is possible to achieve shorter response times for jobs compared to the best singlesite scheduling results. Further, new insights are provided about the amount, characteristics, and distribution of the migrated jobs.
منابع مشابه
An Effective Approach to Job Scheduling in Decentralized Grid Environment
Scheduling of jobs and resource management are the important challenging work in a grid environment. Processing time minimization of the jobs arriving at any computer site in a grid system is one of the major objectives in the research area of computing. In this paper, we propose a decentralized grid system model as a collection of clusters. We then introduce a decentralized job scheduling algo...
متن کاملExploring decentralized dynamic scheduling for grids and clouds using the community-aware scheduling algorithm
Job scheduling strategies have been studied for decades in a variety of scenarios. Due to the new characteristics of the emerging computational systems, such as the grid and cloud, metascheduling turns out to be an important scheduling pattern because it is responsible for orchestrating resources managed by independent local schedulers and bridges the gap between participating nodes. Equally, t...
متن کاملReputation-based dependable scheduling of workflow applications in Peer-to-Peer Grids
Grids facilitate creation of wide-area collaborative environment for sharing computing or storage resources and various applications. Inter-connecting distributed Grid sites through peer-to-peer routing and information dissemination structure (also known as Peer-to-Peer Grids) is essential to avoid the problems of scheduling efficiency bottleneck and single point of failure in the centralized o...
متن کاملA Group Selection Pattern Optimizing Job Scheduling in Decentralized Grid Markets
Decentralized economic models are being considered as scalable coordination mechanism for the management of service allocations to clients. However, decentralization incorporates further dynamicity and unpredictability into the system, degrading its performance. In this paper, a solution based on a self-organized and emergent Group Selection mechanism is proposed. Dynamic congregations evolve G...
متن کاملA New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007